Guided Parsing of Range Concatenation Languages
نویسندگان
چکیده
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity. For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed in time. In this paper, we study a parsing technique whose purpose is to improve the practical efficiency of RCL parsers. The non-deterministic parsing choices of the main parser for a language are directed by a guide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of . The results of a practical evaluation of this method on a wide coverage English grammar are given.
منابع مشابه
TuLiPA - Parsing Extensions of TAG with Range Concatenation Grammars
In this paper we present a parsing framework for extensions of Tree Adjoining Grammars (TAG) called TuLiPA (Tübingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with shared nodes (TT-MCTAG), a TAG-extension that has been proposed to deal with scrambling in free word order languages such as German. The central strategy of the parser is su...
متن کاملFrom Contextual Grammars to Range Concatenation Grammars
Though the field of natural language processing is one of the major aims that has led to the definition of contextual grammars, very little was made on that subject. One reason is certainly the lack of efficient parsers for contextual languages. In this paper we show how some subclasses of contextual grammars can be translated into equivalent range concatenation grammars and can thus be parsed ...
متن کاملLanguages with Concatenation ∗
Parsing for Two-staged Languages with Concatenation ∗ Soonho Kong Wontae Choi Kwangkeun Yi Seoul National University {soon,wtchoi,kwang}@ropas.snu.ac.kr Abstract This article, based on Doh, Kim, and Schmidt’s “abstract parsing” technique, presents an abstract interpretation for statically checking the syntax of generated code in two-staged programs. Abstract parsing is a static analysis techniq...
متن کاملAn Earley Parsing Algorithm for Range Concatenation Grammars
We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to compute the yields of non-terminals as late as possible. Experiments show that, compared to previous approaches, the constraint propagation help...
متن کاملAn Incremental Earley Parser for Simple Range Concatenation Grammar
We present an Earley-style parser for simple range concatenation grammar, a formalism strongly equivalent to linear context-free rewriting systems. Furthermore, we present different filters which reduce the number of items in the parsing chart. An implementation shows that parses can be obtained in a reasonable time.
متن کامل